Search for a rendezvous with lost target at sea

نویسندگان

  • Malika Meghjani
  • Gregory Dudek
چکیده

This paper addresses the search problem for lost floating targets on sea surface. Given the expected search region, we analyze spiral search patterns for finding the target. Specifically, we consider two search patterns: outward spiral and inward spiral. The outward spiral pattern is a greedy strategy which initializes from the mean of the search region and expands outwards to cover the entire region. In contrast, the inward spiral pattern first encapsulates the search area and then moves inwards towards the mean. We hypothesize that the inward spiral patterns give guaranteed search outcomes for the lost targets whereas the outward spiral patterns minimize the search time but not necessarily guarantee a successful outcome. We present a theoretical analysis to parametrize the search problem and we validate it using our simulator for realistic sea trials. We experimentally test the effects of varying the initial location of the lost target and the communication radius between the target and the searching agent. Our simulated results confirm our hypothesis and analytical findings.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Search-and-Rescue Rendezvous

We consider a new type of asymmetric rendezvous search problem in which Agent II needs to give Agent I a ‘gift’ which can be in the form of information or material. The gift can either be transfered upon meeting, as in traditional rendezvous, or it can be dropped off by II at a location he passes, in the hope it will be found by I. The gift might be a water bottle for a traveller lost in the de...

متن کامل

Distributed Search with Rendezvous Search Systems

The ever-growing amount of data made available through the Internet requires powerful and highly scalable search systems. Not only the mostly unstructured data but also the increasing user expectations demand for sophisticated and flexible search primitives like keyword search or XPath. Academic research on peer-to-peer networks has been mostly focused on how to build such advanced primitives o...

متن کامل

Optimal Survivor Search with Multiple States

The optimal survivor search problem is to maximize the probability of finding a moving target alive. The target may be a person missing at sea or lost in a wilderness area. In a multistate target problem, the target is moving and changing states stochastically. Each state may imply different motion and detectability assumptions. We find necessary and sufficient conditions for optimal detection ...

متن کامل

Coordinated decentralized search for a lost target in a Bayesian world

This paper describes a decentralized Bayesian approach to coordinating multiple autonomous sensor platforms searching for a single non-evading target. In this architecture, each decision maker builds an equivalent representation of the target state PDF through a Bayesian DDF network enabling them to coordinate their actions without exchanging any information about their plans. The advantage of ...

متن کامل

Rendezvousing at Familiar and Unfamiliar Places

This paper reports a diary study of rendezvousing as performed by university students. The study compares students’ performance when meeting at familiar and unfamiliar rendezvous points. It reports various findings that help to set goals for the development of personal navigation and related services at appropriate levels. For example, when meeting at novel rendezvous points, students : (i) fai...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016